Let $A = \left\{ {{a_1},\,{a_2},\,{a_3}.....} \right\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of it is formed independently. The number of ways in which subsets can be formed such that $(P-Q)$ contains exactly $2$ elements, is

If $^{2017}C_0 + ^{2017}C_1 + ^{2017}C_2+......+ ^{2017}C_{1008} = \lambda ^2 (\lambda   > 0),$ then remainder when $\lambda $ is divided by $33$ is-

If $^{20}{C_{n + 2}}{ = ^n}{C_{16}}$, then the value of $n$ is

A car will hold $2$ in the front seat and $1$ in the rear seat. If among $6$ persons $2$ can drive, then the number of ways in which the car can be filled is

In an election there are $8$ candidates, out of which $5$ are to be choosen. If a voter may vote for any number of candidates but not greater than the number to be choosen, then in how many ways can a voter vote

If $\sum\limits_{i = 0}^4 {^{4 + 1}} {C_i} + \sum\limits_{j = 6}^9 {^{3 + j}} {C_j} = {\,^x}{C_y}$ ($x$ is prime number), then which one of the following is incorrect